Heuristic Approach for Solving the Multi - PalletPacking

We consider the Distributer's Pallet Packing Problem. This problem is to pack a set of distinct products with given quantities in greater volumes (pallets, containers) and to minimize the number of used volumes. The theoretical objective of nding the best space utilization is restricted by a list of practical aspects (technological constraints, weight distribution over the pallet, stability aspects, etc.). Keeping in mind a general branch and bound framework an eecient heuristic for the considered multi-pallet packing problem is developed. The three-dimensional solution approach uses in the kernel a layer-wise packing strategy with optimal two-dimensional packing patterns. Linear Programming lower bounds for the number of pallets needed to pack the total consignment are developed. Computational experiments show the eeciency of the proposed algorithms.